Meanders: a direct enumeration approach
نویسندگان
چکیده
منابع مشابه
Meanders: A Direct Enumeration Approach
We study the statistics of semi-meanders, i.e. configurations of a set of roads crossing a river through n bridges, and possibly winding around its source, as a toy model for compact folding of polymers. By analyzing the results of a direct enumeration up to n = 29, we perform on the one hand a large n extrapolation and on the other hand we reformulate the available data into a large q expansio...
متن کاملA transfer matrix approach to the enumeration of plane meanders
A closed plane meander of order n is a closed self-avoiding curve intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. While the algorithm has exponential complexity, its rate of growth is much smaller than tha...
متن کاملA Circuit-Based Approach to Efficient Enumeration
We study the problem of enumerating the satisfying valuations of a circuit while bounding the delay, i.e., the time needed to compute each successive valuation. We focus on the class of structured d-DNNF circuits originally introduced in knowledge compilation, a sub-area of artificial intelligence. We propose an algorithm for these circuits that enumerates valuations with linear preprocessing a...
متن کاملA Combinatorial Enumeration Approach For Measuring Anonymity
A recent paper (Edman et al. [6]) has taken a combinatorial approach to measuring the anonymity of a threshold mix anonymous communications system. Their paper looks at ways of matching individual messages sent to individual messages received, irrespective of user, and determines a measure of the anonymity provided by the system. Here we extend this approach to include in the calculation inform...
متن کاملStamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms
By considering a permutation representation for stamp-foldings and semi-meanders we construct tree-like data structures that will allow us to generate these objects in constant amortized time. Additionally, by maintaining the wind-factor and applying an additional optimization, the algorithm for semi-meanders can be modified to produce the fastest known algorithm to generate open meanders.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Physics B
سال: 1996
ISSN: 0550-3213
DOI: 10.1016/s0550-3213(96)00505-6